Unary negation
نویسندگان
چکیده
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the μcalculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, and we pinpoint the complexity of satisfiability, finite satisfiability, and model checking. We also show that the unary negation fragment of first-order logic is model-theoretically very well behaved. In particular, it enjoys Craig Interpolation and the Projective Beth Property.
منابع مشابه
Incrementing Discourse with the Negation Relation
Logical t ranslat ions of English sentences typically translate sentential negation as a unary propositional operator. In this paper, I develop the processing aspect of a rather different ontological perspective on negation: namely, negation as a two-place relation. The negation relation takes one argument, its associate, and relates it to the rest of the sentence which forms the second argumen...
متن کاملUnary Negation * Balder Ten Cate
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the μ-calculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, ...
متن کاملUnary negation fragment with equivalence relations has the finite model property
We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property. More specifically, we show that every satisfiable formula has a model of at most doubly exponential size. We argue that the satisfiability (= finite satisfiabil...
متن کاملCharacterizing Definability in Decidable Fixpoint Logics
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-model property and a refinement of the method of moving back...
متن کاملMinimal and Subminimal Logic of Negation
Starting from the original formulation of minimal propositional logic proposed by Johansson, this thesis aims to investigate some of its relevant subsystems. The main focus is on negation, defined as a primitive unary operator in the language. Each of the subsystems considered is defined by means of some ‘axioms of negation’: different axioms enrich the negation operator with different properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2011